<scp>SISTA</scp>: Learning Optimal Transport Costs under Sparsity Constraints
نویسندگان
چکیده
In this paper, we describe a novel iterative procedure called SISTA to learn the underlying cost in optimal transport problems. is hybrid between two classical methods, coordinate descent (“S”-inkhorn) and proximal gradient (“ISTA”). It alternates phase of exact minimization over potentials parameters cost. We prove that method converges linearly, illustrate on simulated examples it significantly faster than both ISTA. apply estimating model migration, which predicts flow migrants using country-specific characteristics pairwise measures dissimilarity countries. This application demonstrates effectiveness machine learning quantitative social sciences. © 2022 Wiley Periodicals LLC.
منابع مشابه
Optimal State-Feedback Control Under Sparsity and Delay Constraints
This paper presents the solution to a general decentralized state-feedback problem, in which the plant and controller must satisfy the same combination of delay constraints and sparsity constraints. The control problem is decomposed into independent subproblems, which are solved by dynamic programming. In special cases with only sparsity or only delay constraints, the controller reduces to exis...
متن کاملEstimation of Covariance Matrices under Sparsity Constraints
Discussion of “Minimax Estimation of Large Covariance Matrices under L1-Norm” by Tony Cai and Harrison Zhou. To appear in Statistica Sinica. Introduction. Estimation of covariance matrices in various norms is a critical issue that finds applications in a wide range of statistical problems, and especially in principal component analysis. It is well known that, without further assumptions, the em...
متن کاملHeterogeneous multitask learning with joint sparsity constraints
Multitask learning addresses the problem of learning related tasks whose information on parameters is assumed to be shared with each other. Previous approaches usually deal with homogeneous tasks such as a set of regression tasks only or a set of classification tasks only. In this paper, we consider the problem of learning multiple related tasks, where tasks consist of predicting both continuou...
متن کاملDictionary Learning with Spatio-spectral Sparsity Constraints
Devising efficient sparse decomposition algorithms in large redundant dictionaries has attracted much attention recently. However, choosing the right dictionary for a given data set remains an issue. An interesting approach is to learn the best dictionary from the data itself. The purpose of this contribution is to describe a new dictionary learning algorithm for multichannel data analysis purp...
متن کاملOptimal Investment Under Transaction Costs
We investigate how and when to diversify capital over assets, i.e., the portfolio selection problem, from a signal processing perspective. To this end, we first construct portfolios that achieve the optimal expected growth in i.i.d. discrete-time two-asset markets under proportional transaction costs. We then extend our analysis to cover markets having more than two stocks. The market is modele...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Pure and Applied Mathematics
سال: 2022
ISSN: ['1097-0312', '0010-3640']
DOI: https://doi.org/10.1002/cpa.22047